A Study of Non-smooth Convex Flow Decomposition

نویسندگان

  • Jing Yuan
  • Christoph Schnörr
  • Gabriele Steidl
  • Florian Becker
چکیده

We present a mathematical and computational feasibility study of the variational convex decomposition of 2D vector fields into coherent structures and additively superposed flow textures. Such decompositions are of interest for the analysis of image sequences in experimental fluid dynamics and for highly non-rigid image flows in computer vision. Our work extends current research on image decomposition into structural and textural parts in a twofold way. Firstly, based on Gauss’ integral theorem, we decompose flows into three components related to the flow’s divergence, curl, and the boundary flow. To this end, we use proper operator discretizations that yield exact analogs of the basic continuous relations of vector analysis. Secondly, we decompose simultaneously both the divergence and the curl component into respective structural and textural parts. We show that the variational problem to achieve this decomposition together with necessary compatibility constraints can be reliably solved using a single convex second-order conic program.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Domain decomposition for a non-smooth convex minimization problem and its application to plasticity

P.L. Lions's work on the Schwarz alternating method for convex minimization problems is generalized to a certain non-smooth situation where the non-diierentiable part of the functionals is additive and independent with respect to the decomposition. Such functionals arise naturally in plasticity where the material law is a variational inequality formulated in L 2 ((). The application to plastici...

متن کامل

Lifted coordinate descent for learning with trace-norm regularization

We consider the minimization of a smooth loss with trace-norm regularization, which is a natural objective in multi-class and multitask learning. Even though the problem is convex, existing approaches rely on optimizing a non-convex variational bound, which is not guaranteed to converge, or repeatedly perform singular-value decomposition, which prevents scaling beyond moderate matrix sizes. We ...

متن کامل

حل مسئله پخش بار بهینه در شرایط نرمال و اضطراری با استفاده از الگوریتم ترکیبی گروه ذرات و نلدر مید (PSO-NM)

In this paper, solving optimal power flow problem has been investigated by using hybrid particle swarm optimization and Nelder Mead Algorithms. The goal of combining Nelder-Mead (NM) simplex method and particle swarm optimization (PSO) is to integrate their advantages and avoid their disadvantages. NM simplex method is a very efficient local search procedure but its convergence is extremely sen...

متن کامل

High order structural image decomposition by using non-linear and non-convex regularizing objectives

The paper addresses structural decomposition of images by using a family of non-linear and non-convex objective functions. These functions rely on `p quasi-norm estimation costs in a piecewise constant regularization framework. These objectives make image decomposition into constant cartoon levels and rich textural patterns possible. The paper shows that these regularizing objectives yield imag...

متن کامل

SVD-free Convex-Concave Approaches for Nuclear Norm Regularization

Minimizing a convex function of matrices regularized by the nuclear norm arises in many applications such as collaborative filtering and multi-task learning. In this paper, we study the general setting where the convex function could be non-smooth. When the size of the data matrix, denoted bym×n, is very large, existing optimization methods are inefficient because in each iteration, they need t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005